Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Nonlinear once time once password (t,n) threshold secret sharing scheme
FAN Chang RU Peng
Journal of Computer Applications    2013, 33 (09): 2536-2539.   DOI: 10.11772/j.issn.1001-9081.2013.09.2536
Abstract686)      PDF (727KB)(486)       Save
To address the problem that secret sharing scheme constructed by linear algorithm has security vulnerabilities, and to solve the problem that it easily leads to a single point of failure and unreliable situations with trusted party, this paper proposed a nonlinear threshold secret sharing scheme which combined nonlinear algorithm and cryptography. The scheme was based on two nonlinear structures of chaos algorithm and finite state automata, so it can generate random and dynamic shares. Participants can control each round shares to achieve the security level of once or N times a password. Secret was recovered by the Lagrange interpolation formula. Secure multiparty computation restricted every participant so that the scheme satisfied resilient equilibrium and could withstand chicanery or conspiracy attack.
Related Articles | Metrics